Active Node Detection in A Reconfigurable Microgrid Using Minimum Spanning Tree Algorithms

نویسندگان

  • Anay Majee
  • Souradeep Nanda
چکیده

Microgrids are the solution to the growing demand for energy in the recent times. It has the potential to improve local reliability, reduce cost and increase penetration rates for distributed renewable energy generation. Inclusion of Renewable Energy Systems(RES) which have become the topic of discussion in the recent times due to acute energy crisis, causes the power flow in the microgrid to be bidirectional in nature. The presence of the RES in the microgrid system causes the grid to be reconfigurable. This reconfiguration might also occur due to load or utility grid connection and disconnection. Thus conventional protection strategies are not applicable to micro-grids and is hence challenging for engineers to protect the grid in a fault condition. In this paper various Minimum Spanning Tree(MST) algorithms are applied in microgrids to identify the active nodes of the current topology of the network in a heuristic approach and thereby generating a tree from the given network so that minimum number of nodes have to be disconnected from the network during fault clearance. In the paper we have chosen the IEEE-39 and IEEE-69 bus networks as our sample test systems.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem

The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...

متن کامل

Constant-time Algorithms for Minimum Spanning Tree and Related Problems on Processor Array with Reconfigurable Bus Systems

A processor array with a reconfigurable bus system is a parallel computation model that consists of a processor array and a reconfigurable bus system. In this paper, a constant-time algorithm is proposed on this model for finding the cycles in an undirected graph. We can use this algorithm to decide whether a specified edge belongs to the minimum spanning tree of the graph or not. This cycle-fi...

متن کامل

Quasi Random Deployment Strategy for Reliable Communication Backbones in Wireless Sensor Networks

Topology construction and topology maintenance are significant sub-problems of topology control. Spanning tree based algorithms for topology control are basically transmission range based type construction algorithms. The construction of an effective backbone, however, is indirectly related to the placement of nodes. Also, the dependence of network reliability on the communication path undertak...

متن کامل

SOLVING A STEP FIXED CHARGE TRANSPORTATION PROBLEM BY A SPANNING TREE-BASED MEMETIC ALGORITHM

In this paper, we consider the step fixed-charge transportation problem (FCTP) in which a step fixed cost, sometimes called a setup cost, is incurred if another related variable assumes a nonzero value. In order to solve the problem, two metaheuristic, a spanning tree-based genetic algorithm (GA) and a spanning tree-based memetic algorithm (MA), are developed for this NP-hard problem. For compa...

متن کامل

Fault Detection in Ring Based Smart LVDC Microgrid Using Ensemble of Decision Tree

In modern infrastructure, the demand for DC power-based appliances is rapidly increasing, and this phenomenon has created a positive impact on the acceptance of the DC microgrid. However, due to numerous issues such as the absence of zero crossing, bidirectional behaviour of sources, and different magnitudes of fault current during grid connected and islanded modes of operation, protecting DC m...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017